Correctness Proofs of CSP Programs
نویسنده
چکیده
In a research report we have proposed an axiomatic semantics for the language of communicating sequential processes (CSP: of Hoare (1978). In this paper, we use the axiomatic semantics to prove the correctness of a number of CSY programs.
منابع مشابه
Algebraic Proof Assistants in HOL
We explore several ways to formalize the algebraic laws of CSP-like languages in HOL. The intent of the paper is to show how HOL can be tailored to acting as a proof assistant. The emphasis is therefore on the consequences of various choices to be made during the formalization for writing tactics. We end up with a proof assistant that allows a user to make steps of the granularity of an algebra...
متن کاملThe Sliding-Window Protocol in CSP
A formal specification and proof of correctness is given of the sliding window protocol using the notation of Communicating Sequential Pro cesses. First the stop-and-wait protocol is defined; its correetne8S, that it forms a I-place buffer, is almost evident. Next the alternating-bit protocol is defined and described in terms of the stop-and-wait proto col, and its correctness deduced. Final...
متن کاملA proof-producing CSP solver: A proof supplement
In [1] we described PCS, a CSP solver that can produce a machinecheckable deductive proof for an unsatisfiable input problem. This report supplements [1] in several ways: it provides soundness proof for the inference rules that were presented in Table 3; it provides proofs of correctness for several algorithms and claims; and, finally, it adds several missing algorithms and optimizations.
متن کامل2 Generation of Proof Obligations
1 Background The system PAMELA (Proof Assistant for Meta IV-like Languages) was designed originally to check partial correctness of VDM-like speciications 3] of code generators with respect to implicit speciications given as sets of pre-and postconditions 1]. Explicit speciications in this framework essentially are systems of mutually recursive functions and procedures (in the following called ...
متن کاملAutomatically Generated CSP Provides Verification for occam-derived Logic Circuits
This paper reports on the creation of a new back-end for the authors’ occam-to-FPGA compiler. The creation of Communicating Sequential Processes (CSP) models of compiler-generated logic circuits has thus recently been automated. These models are now being used to provide reference testing of the compiler as it undergoes further implementation and refinement, as well as to verify components of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 1983